Knitting Sort: A Novel Stable and Inplace Sorting Technique (An Extension of Exchange Sorting with Bitonic Sorting Network)
نویسندگان
چکیده
One of the most frequent operations performed on database is searching. To perform this operation we have different kinds of searching algorithms, some of which are Binary Search, Linear Search, Quadratic search[1], but these and all other searching algorithms work only on data, which are previously sorted. An efficient algorithm is required in order to make the searching algorithm fast and efficient. Sorting is an algorithm that arranges all elements of an array, orderly. Sorting Technique is frequently used in a large variety of important applications to arrange the data in ascending or descending order. Several Sorting Algorithms of different time and space complexity are exist and used[9], but they are not suitable because some are stable but not inplace such as merge sort, and other are inplace but not stable such as Quick sort. Two approaches of 2-way merging (odd-even merging and bitonic merging ) have been proposed by Batcher[16]. kway bitonic sort based on 2-way merging(i.e. two monotonic sequences of n numbers merging is completed by k m-way bitonc sorters[12] and m k-key bitonic sorters, where 2n=km and “k-key means k numbers”) has been proposed by Nakatani et al.[17] and Batcher[18].Since the early work of Batcher, much work has been done on parallel processing system,multi-access memory systems, and so on. This research paper presents a new sorting algorithm named as Knitting Sort which is stable as well as Inplace also. In this algorithm the technique of exchanging elements is used. It is shown in this paper that by various manners of comparisons and swapping the array is sorted. The technique of bitonic sorting network is used to implement this algorithm. The Knitting Sort is implemented on an array to sort it in ascending or descending order. The average case time complexity for this algorithm is ɵ(n).
منابع مشابه
Fast Parallel Sorting Algorithms on Gpus
This paper presents a comparative analysis of the three widely used parallel sorting algorithms: OddEven sort, Rank sort and Bitonic sort in terms of sorting rate, sorting time and speed-up on CPU and different GPU architectures. Alongside we have implemented novel parallel algorithm: min-max butterfly network, for finding minimum and maximum in large data sets. All algorithms have been impleme...
متن کاملArea Efficient Sorting Unit Using Scalable Digital CMOS Comparator
Sorting is the process of arranging the data into a meaningful order so that we can analyze it more effectively. Sorting is a key requirement in many applications like digital signal processing, scientific computing, network processing etc. This paper presents an area efficient technique for designing high throughput and low latency sorting units. Two popular parallel sorting algorithms are u...
متن کاملA Study of Sort Algorithms for Multiprocessor Database Machines
This paper presents and analyzes algorithms for parallel execution of sort operations in a general multiprocessor architecture. We consider both internal and external sorting algorithms. For the latter, we study the performance of sorting algorithms that are derived from sorting algorithms that only do comparison and exchange by replacing each comparison-exchange with a B-way merge. In particul...
متن کاملBitonic Sorting on Bene Networks
An algorithm derived from bitonic sorting networks and appropriate routings are presented which will sort a set of N inputs via a Beneš network. An expanded version of Knuth diagrams for sorting networks is also presented which illustrates the address line logic within the network.
متن کاملThe Bitonic Sort on Transputer Architectures
The bitonic sort algorithm is a parallel sorting algorithm that has been implemented in sorting networks and is readily adaptable to Transputer arrays. This paper looks at the implementation and time cost of the algorithm for a machine and compares this with an implementation on T8 networks to see the benefits that the new architecture provides over the previous generation of Transputers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014